. A C ] 1 7 Ju l 2 00 3 DISTRIBUTIVE LATTICES , BIPARTITE GRAPHS AND ALEXANDER DUALITY
نویسنده
چکیده
A certain squarefree monomial ideal HP arising from a finite partially ordered set P will be studied from viewpoints of both commutative algebra and combinatorics. First, it is proved that the defining ideal of the Rees algebra of HP possesses a quadratic Gröbner basis. Thus in particular all powers of HP have linear resolutions. Second, the minimal free graded resolution of HP will be constructed explicitly and a combinatorial formula to compute the Betti numbers of HP will be presented. Third, by using the fact that the Alexander dual of the simplicial complex ∆ whose Stanley–Reisner ideal coincides with HP is Cohen–Macaulay, all the Cohen–Macaulay bipartite graphs will be classified.
منابع مشابه
Distributive Lattices, Bipartite Graphs and Alexander Duality
A certain squarefree monomial ideal HP arising from a finite partially ordered set P will be studied from viewpoints of both commutative algbera and combinatorics. First, it is proved that the defining ideal of the Rees algebra of HP possesses a quadratic Gröbner basis. Thus in particular all powers of HP have linear resolutions. Second, the minimal free graded resolution of HP will be construc...
متن کاملS ep 2 00 7 Almost Euclidean subspaces of l N 1 via expander codes
We give an explicit (in particular, deterministic polynomial time) construction of subspaces X ⊆ RN of dimension (1− o(1))N such that for every x ∈ X, (logN)−O(log log logN) √ N ‖x‖2 6 ‖x‖1 6 √ N ‖x‖2. If we are allowed to useN1/ log logN 6 No(1) random bits and dim(X) > (1−η)N for any fixed constant η, the lower bound can be further improved to (logN)−O(1) √ N‖x‖2. Our construction makes use o...
متن کاملMatchings in Vertex-transitive Bipartite Graphs
A theorem of A. Schrijver asserts that a d–regular bipartite graph on 2n vertices has at least ( (d− 1)d−1 dd−2 )n perfect matchings. L. Gurvits gave an extension of Schrijver’s theorem for matchings of density p. In this paper we give a stronger version of Gurvits’s theorem in the case of vertex-transitive bipartite graphs. This stronger version in particular implies that for every positive in...
متن کاملar X iv : 0 90 4 . 31 16 v 1 [ cs . C C ] 2 0 A pr 2 00 9 Variations on Muchnik ’ s Conditional Complexity Theorem ⋆
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length and is simple conditional on b. In this paper we present two new proofs of this theorem. The first one is based on the on-line matching algorithm for bipartite graphs. The second one, based on extractors, can be general...
متن کاملar X iv : m at h / 97 05 21 9 v 1 [ m at h . C O ] 1 1 M ay 1 99 7 COMPLEXES OF NOT i - CONNECTED GRAPHS
Complexes of (not) connected graphs, hypergraphs and their homology appear in the construction of knot invariants given by V. Vassiliev [V1, V2, V3]. In this paper we study the complexes of not i-connected k-hypergraphs on n vertices. We show that the complex of not 2-connected graphs has the homotopy type of a wedge of (n − 2)! spheres of dimension 2n − 5. This answers one of the questions rai...
متن کامل